Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates

This paper reviews a set of ten existing metaheuristic solution procedures for the resource-constrained multi-project scheduling problem. Algorithmic implementations are constructed based on description original in literature. Equivalence is verified test instances objective and parameters through comparison with reported results. An extensive benchmark analysis performed novel, publicly available dataset variety optimisation criteria due date settings which algorithms have not been tested earlier. The impact different objectives, dates instance analysed an overall ranking methods situations discussed. Key insights into structure competitive solutions disparate objectives presented effective algorithmic components revealed.